Petri Nets with Structured Data

Petri Nets with Structured Data

This paper proposes Structured Data Nets (StDN), a Petri net extension that describes transactional systems with data. In StDNs, tokens are structured documents. Each transition is attached to a query, guarded by patterns, (logical assertions on the contents of its preset) and transforms tokens. We define StDNs and their semantics. We then consider their formal properties: coverability of a mar...

Well-structured Petri Nets extensions with data

Comparing Petri Data Nets and Timed Petri Nets

Well-Structured Transitions Systems (WSTS) constitute a generic class of infinite-state systems for which several properties like coverability remain decidable. The family of coverability languages that they generate is an appropriate criterium for measuring their expressiveness. Here we establish that Petri Data nets (PDNs) and Timed Petri nets (TdPNs), two powerful classes of WSTS are equival...

Petri Nets With Persistence

Persistence of information is common in modern computer systems. This paper describes how to extend Petri nets, a traditional model of concurrent and distributed computations, to take account of conditions that are persistent. We found use for this kind of nets in modelling untrustworthy networks on which messages are exchanged according to a security protocol. The paper explains a construction...

Algorithm Modelling with Petri Nets - Comparison with Data Dependence Graphs

This article focuses on algorithm representation by means of Petri Nets. The basic structural features of algorithms are dictated by their data and control dependencies. These dependencies refer to the precedence relations of computation that need to be satis ed in order to compute the problem correctly. The absence of dependencies indicates the possibility of simultaneous computations (the few...